On the Random-Self-Reducibility of Complete Sets
نویسندگان
چکیده
In this paper, we generalize the previous formal de nitions of random-self-reducibility. We show that, even under our very general de nition, sets that are complete for any level of the polynomial hierarchy are not nonadaptively random-self-reducible, unless the hierarchy collapses. In particular, NP-complete sets are not nonadaptively random-self-reducible, unless the hierarchy collapses at the third level. By contrast, we show that sets complete for the classes PP and MODmP are random-self-reducible.
منابع مشابه
Resource Bounded Randomness and Weakly Complete Problems 1
We introduce and study resource bounded random sets based on Lutz's concept of resource bounded measure ((7, 8]). We concentrate on n c-randomness (c 2) which corresponds to the polynomial time bounded (p-) measure of Lutz, and which is adequate for studying the internal and quantitative structure of E = DTIME(2 lin). However we will also comment on E2 = DTIME(2 pol) and its corresponding (p2-)...
متن کاملOn Coherence, Random-self-reducibility, and Self-correction1
We address two questions about self-reducibility the power of adaptiveness in examiners that take advice and the relationship between random-self-reducibility and self-correctability. We rst show that adaptive examiners are more powerful than nonadaptive examiners, even if the nonadaptive ones are nonuniform: There exists a coherent function that is not nonadaptively coherent, even via nonadapt...
متن کاملApproximable Sets Universitt at Karlsruhe
Much structural work on NP-complete sets has exploited SAT's d-self-reduci-bility. In this paper we exploit the additional fact that SAT is a d-cylinder to show that NP-complete sets are p-superterse unless P = NP. In fact, every set that is NP-hard under polynomial-time n o(1)-tt reductions is p-superterse unless P = NP. In particular no p-selective set is NP-hard under polynomial-time n o(1)-...
متن کاملOn Self-Reducible Sets of Low Information Content
Self-reducible sets have a rich internal structure. The information contained in these sets is encoded in some redundant way. Therefore a lot of the information of the set is easily accessible. In this paper it is investigated how this self-reducibility structure of a set can be used to access easily all information contained in the set, if its information content is small. It is shown that P c...
متن کاملCoherence , Random - Self - Reducibility , and Self
We study three types of self-reducibility that are motivated by the theory of program veriication. A set A is random-self-reducible if one can determine whether an input x is in A by making random queries to an A-oracle. The distribution of each query may depend only on the length of x. A set B is self-correctable over a distribution D if one can convert a program that is correct on most of the...
متن کامل